Decoding Choice Encodings

Decoding Choice Encodings

We study two encodings of the asynchronous π-calculus with input-guarded choice into its choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of choice into gradual commitment. The other preserves atomicity, but introduces divergence. The divergent encoding is fully abstract with respect to weak bisimulation, but the more natural divergence-free encoding is n...

Decoding Coattention Encodings for Question Answering

An encoder-decoder architecture with recurrent neural networks in both the encoder and decoder is a standard approach to the question-answering problem (finding answers to a given question in a piece of text). The Dynamic Coattention[1] encoder is a highly effective encoder for the problem; we evaluated the effectiveness of different decoder when paired with the Dynamic Coattention encoder. We ...

Soft-decision decoding of linear block codes using efficient iterative G-space encodings

Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources

We consider the multi-user lossy source-coding problem for continuous alphabet sources. In a previous work, Ziv proposed a single-user universal coding scheme which uses uniform quantization with dither, followed by a lossless source encoder (entropy coder). In this paper, we generalize Ziv’s scheme to the multi-user setting. For this generalized universal scheme, upper bounds are derived on th...

Comparing Object Encodings

Recent years have seen the development of several foundational models for statically typed object oriented programming But despite their intuitive similarity di erences in the technical machinery used to formulate the various proposals have made them di cult to compare Using the typed lambda calculus F as a common basis we now o er a detailed comparison of four models a recursive record encodin...